Second-Order-Cone Constraints for Extended Trust-Region Subproblems
نویسندگان
چکیده
The classical trust-region subproblem (TRS) minimizes a nonconvex quadratic objective over the unit ball. In this paper, we consider extensions of TRS having extra constraints. When two parallel cuts are added to TRS, we show that the resulting nonconvex problem has an exact representation as a semidefinite program with additional linear and second-order-cone constraints. For the case where an additional ellipsoidal constraint is added to TRS, resulting in the “two trust-region subproblem” (TTRS), we provide a new relaxation including second-order-cone constraints that strengthens the usual SDP relaxation.
منابع مشابه
Trust Region Subproblem with a Fixed Number of Additional Linear Inequality Constraints Has Polynomial Complexity∗
The trust region subproblem with a fixed number m additional linear inequality constraints, denoted by (Tm), have drawn much attention recently. The question as to whether Problem (Tm) is in Class P or Class NP remains open. So far, the only affirmative general result is that (T1) has an exact SOCP/SDP reformulation and thus is polynomially solvable. By adopting an early result of Mart́ınez on l...
متن کاملSl1QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems
In this paper, we propose an algorithm based on Fletcher’s Sl1QP method and the trust region technique for solving Nonlinear Second-Order Cone Programming (NSOCP) problems. The Sl1QP method was originally developed for nonlinear optimization problems with inequality constraints. It converts a constrained optimization problem into an unconstrained problem by using the l1 exact penalty function, ...
متن کاملThe solution of Euclidean norm trust region SQP subproblems via second order cone programs, an overview and elementary introduction
It is well known that convex SQP subproblems with a Euclidean norm trust region constraint can be reduced to second order cone programs for which the theory of Euclidean Jordan-algebras leads to efficient interior-point algorithms. Here, a brief and self-contained outline of the principles of such an implementation is given. All identities relevant for the implementation are derived from scratc...
متن کاملAn Active Set Method for Single-Cone Second-Order Cone Programs
We develop an active set method for solving second-order cone programs that may have an arbitrary number of linear constraints but are restricted to have only one second-order cone constraint. Problems of this form arise in the context of robust optimization and trust region methods. The proposed active set method exploits the fact that a second-order cone program with only one second-order con...
متن کاملTrust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as exact semidefinite linear programming relaxation (SDP-relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 23 شماره
صفحات -
تاریخ انتشار 2013